Spanning trees with minimum weighted degrees
نویسندگان
چکیده
Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree), the weighted degree of a vertex is defined as the sum of the weights of its incident edges. In this paper, we propose a 4.5-approximation algorithm for this problem. We also prove it is NP-hard to approximate this problem within a 2 − ε factor. © 2007 Elsevier B.V. All rights reserved.
منابع مشابه
On relation between the Kirchhoff index and number of spanning trees of graph
Let $G=(V,E)$, $V={1,2,ldots,n}$, $E={e_1,e_2,ldots,e_m}$,be a simple connected graph, with sequence of vertex degrees$Delta =d_1geq d_2geqcdotsgeq d_n=delta >0$ and Laplacian eigenvalues$mu_1geq mu_2geqcdotsgeqmu_{n-1}>mu_n=0$. Denote by $Kf(G)=nsum_{i=1}^{n-1}frac{1}{mu_i}$ and $t=t(G)=frac 1n prod_{i=1}^{n-1} mu_i$ the Kirchhoff index and number of spanning tree...
متن کاملA New Efficient Technique to Construct a Minimum Spanning Tree
A minimum spanning tree of a weighted graph is a tree of the graph which contains all the vertices of the graph and the sum of weights of all its edges are minimum among all such possible trees of the graph. In this paper, we have proposed a new technique and its corresponding algorithm to construct the minimum spanning tree of a weighted graph. This new algorithm is based on the weight matrix ...
متن کاملRepresenting all Minimum Spanning Trees with Applications to Counting and Generation
We show that for any edge-weighted graph G there is an equivalent graph EG such that the minimum spanning trees of G correspond one-for-one with the spanning trees of EG. The equivalent graph can be constructed in time O(m + n log n) given a single minimum spanning tree of G. As a consequence we can count the minimum spanning trees of G in time O(m+ n), generate a random minimum spanning tree i...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملOn Algorithm for the Minimum Spanning Trees Problem with Diameter Bounded Below
The minimum spanning trees problem is to find k edge-disjoint spanning trees in a given undirected weighted graph. It can be solved in polynomial time. In the k minimum spanning trees problem with diameter bounded below (k-MSTBB) there is an additional requirement: a diameter of every spanning tree must be not less than some predefined value d. The k-MSTBB is NP hard. We propose an asymptotical...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 104 شماره
صفحات -
تاریخ انتشار 2007